Stratego/XT An Annotated Bibliography

The first ideas about programmable rewriting strategies supporting generic term traversal were developed in the algebraic specification formalism ASF+SDF [3]. That paper introduces the 2 (all) and 3 (one) traversal primitives, and their use in the definition of full term traversals such as bottomup, topdown, and innermost. The calculus of strategy operators is further developed and formalized using an operational semantics in [5]. Rewrite rules are no longer considered as primitives, but are broken down into the more basic actions of matching and building terms. This allows other combinations in which matching and term construction are used, including contextual rules and variable binding constructs used